Spanning tree congestion of rook's graphs
نویسندگان
چکیده
Let G be a connected graph and T be a spanning tree of G. For e ∈ E(T ), the congestion of e is the number of edges in G joining the two components of T − e. The congestion of T is the maximum congestion over all edges in T . The spanning tree congestion of G is the minimum congestion over all its spanning trees. In this paper, we determine the spanning tree congestion of the rook’s graph Km Kn for any m and n.
منابع مشابه
Counting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملMinimum congestion spanning trees in bipartite and random graphs
The first problem considered in this paper: is it possible to find upper estimates for the spanning tree congestion for bipartite graphs which are better than for general graphs? It is proved that there exists a bipartite version of the known graph with spanning tree congestion of order n 3 2 , where n is the number of vertices. The second problem is to estimate spanning tree congestion of rand...
متن کاملOn Spanning Tree Congestion of Product Graphs
In this paper we consider the spanning tree congestion for several families of graphs. We find the exact spanning tree congestion for toroidal meshes, Cm×Cn, and cylindrical meshes, Pm×Cn,. Also we find bounds for the spanning tree congestion of Qn, and a construction that gives the upper bound.
متن کاملSpanning tree congestion: duality and isoperimetry. With an application to multipartite graphs
In this paper we (1) Describe two approaches to estimates of the spanning tree congestion from below; (2) Use the isoperimetric approach to find the exact value of the spanning tree congestion of complete multipartite graphs; (3) Present a proof of the isoperimetric result of Piliposyan-Muradyan for complete multipartite graphs.
متن کاملSpanning Tree Congestion of Planar Graphs
The paper is devoted to estimates of the spanning tree congestion for some planar graphs. The main results of the paper: (1) We almost determined (up to ±1) the maximal possible spanning tree congestion for planar graphs. (2) The value of congestion indicator introduced in Ostrovskii [Discrete Math. 310 (2010), no. 6–7, 1204–1209] can be very far from the value of the spanning tree congestion. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 31 شماره
صفحات -
تاریخ انتشار 2011